Geometric Packing under Nonuniform Constraints
نویسندگان
چکیده
منابع مشابه
Packing under Tolerance Constraints Technische Universit at M Unchen Packing under Tolerance Constraints (preliminary Version)
Let N = f1; 2; : : : ; ng and c 2 Rn: A k-tuple (t1; : : : ; tk) of elements in N is called an acceptable cell if 1 k Xi=1 cti 1: We consider the problems of (i) nding the set T of all acceptable cells e ciently (ii) nding a maximum number of mutually disjoint acceptable cells. The latter problem is called k-packing under tolerance constraints. For both problems, heuristics and exact solution a...
متن کاملBin Packing with Geometric Constraints in Computer Network Design
We consider the bin-packing problem with the constraint that the elements are in the plane, and only elements within an oriented unit square can be placed within a single bin. The elements are of given weights, and the bins have unit capacities. The problem is to minimize the number of bins used. Since the problem is obviously NP-hard, no algorithm is likely to solve the problem optimally in be...
متن کاملAutomatic Reasoning for Design Under Geometric Constraints
Parametric design is very stable but requires a predefined dimensioning and ordering scheme, thus limiting flexibility and precluding sketch input. Variational geometry design, while general and flexible, necessitates intensive use of numerical solvers to solve many simultaneous nonlinear equations. Frequently the solvers cannot solve these equations. A new system, based on an original theory f...
متن کاملEfficient Submodular Function Maximization under Linear Packing Constraints
We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix A ∈ [0, 1]m×n, a vector b ∈ [1,∞)m, and a monotone submodular set function f : 2 → R+. The objective is to find a set S that maximizes f(S) subject to AxS ≤ b. Here, xS stands for the characteristic vector of the set S. A well-studied spec...
متن کاملProtein decoy assembly using short fragments under geometric constraints.
A small set of protein fragments can represent adequately all known local protein structure. This set of fragments, along with a construction scheme that assembles these fragments into structures, defines a discrete (relatively small) conformation space, which approximates protein structures accurately. We generate protein decoys by sampling geometrically valid structures from this conformation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2017
ISSN: 0097-5397,1095-7111
DOI: 10.1137/120898413